نتایج جستجو برای: Continuous Problems
تعداد نتایج: 824682 فیلتر نتایج به سال:
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
we have devided the thesis in to five chapters. the first recollects facts from purely algebraic theory of jordan algebras and also basic properties of jb and jb* - algebras which are needed in the sequel. in the second chapter we extend to jb* - algebras, a classical result due to cleveland [8]. this result shows shows the weakness of jb* - norm topology on a jb* - algebera. in chapter three, ...
In this paper, the concept of pseudoconvexity and quasiconvexity for continuous~-time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming problems are presented. Finally, some characterizations of the soluti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید